Note on winning positions on pushdown games with omega-regular winning conditions
نویسنده
چکیده
We consider infinite two-player games on pushdown graphs. For parity winning conditions, we show that the set of winning positions of each player is regular and we give an effective construction of an alternating automaton recognizing it. This provides a DEXPTIME procedure to decide whether a position is winning for a given player. Finally, using the same methods, we show, for any ω-regular winning condition, that the set of winning positions for a given player is regular and effective.
منابع مشابه
A study of pushdown games
Infinite two-player games are of interest in computer science since they provide an algorithmic framework for the study of reactive nonterminating systems. Usually, an infinite game is specified by an ω-language containing all winning plays for one of the two players or by a game graph and a winning condition on infinite paths through this graph. Many algorithmic results are known for the case ...
متن کاملInfinite Games over Higher-Order Pushdown Systems
In this thesis we deal with games over infinite graphs with regular winning conditions. A well studied family of such games are the pushdown games. An important result for these games is that the winning region can be described by regular sets of configurations. We extend this result to games defined by higher-order pushdown systems. The higher-order pushdown systems extend the usual pushdown s...
متن کاملOptimizing Winning Strategies in Regular Infinite Games
We consider infinite two-player games played on finite graphs where the winning condition (say for the first player) is given by a regular omega-language. We address issues of optimization in the construction of winning strategies in such games. Two criteria for optimization are discussed: memory size of finite automata that execute winning strategies, and – for games with liveness requests as ...
متن کاملParametrized Infinite Games and Higher-Order Pushdown Strategies
We consider infinite two-player games parametrized by a set P of natural numbers where the winning condition is given by a regular ω-language (including the parameter P ). Extending recent work of Rabinovich we study here predicates P where the structure (N,+1, P ) belongs to the pushdown hierarchy (or “Caucal hierarchy”). For such a predicate P where (N,+1, P ) occurs in the k-th level of the ...
متن کاملConcurrent Omega-Regular Games
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose their moves independently and simultaneously; the current state and the two moves determine a successor state. We consider omega-regular winning conditions on the resulting infinite state sequence. To model the independe...
متن کامل